import java.util.LinkedList;
import java.util.Queue;

class MyCircularQueue {
    public int[] elem;
    public int front;
    public int rear;

    public MyCircularQueue(int k) {
        elem=new int[k+1];
    }
    
    public boolean enQueue(int value) {
        if(isFull()){
            return  false;
        }
        elem[rear]=value;
        rear=(rear+1)%elem.length;
        return true;

    }
    
    public boolean deQueue() {
        if(isEmpty()){
            return false;
        }
        front=(front+1)%elem.length;
        return true;
    }
    
    public int Front() {
        if(isEmpty()){
            return -1;
        }
        return elem[front];

    }
    
    public int Rear() {
        if(isEmpty()){
            return -1;
        }
        return (rear==0)? elem[elem.length-1] : elem[rear-1];


    }
    
    public boolean isEmpty() {
        return rear==front;

    }
    
    public boolean isFull() {
        return (rear+1)%elem.length==front;

    }
}